Quasi-subfield Polynomials and the Elliptic Curve Discrete Logarithm Problem
نویسندگان
چکیده
منابع مشابه
Attacking the Elliptic Curve Discrete Logarithm Problem
Definition 1.1. Given a finite abelian group G written multiplicatively and elements b and g in G, the discrete logarithm problem (DLP) consists of finding an integer n such that bn = g, if such an n exists. The difficulty involved in computing the discrete logarithm varies with the choice of G. For example, in the additive group of integers modulo n, (Z/nZ)+, the problem can be solved efficien...
متن کاملAn efficient blind signature scheme based on the elliptic curve discrete logarithm problem
Elliptic Curve Cryptosystems (ECC) have recently received significant attention by researchers due to their high performance such as low computational cost and small key size. In this paper a novel untraceable blind signature scheme is presented. Since the security of proposed method is based on difficulty of solving discrete logarithm over an elliptic curve, performance of the proposed scheme ...
متن کاملElliptic divisibility sequences and the elliptic curve discrete logarithm problem
We use properties of the division polynomials of an elliptic curve E over a finite field Fq together with a pure result about elliptic divisibility sequences from the 1940s to construct a very simple alternative to the Menezes-Okamoto-Vanstone algorithm for solving the elliptic curve discrete logarithm problem in the case where #E(Fq) = q − 1.
متن کاملThe new protocol blind digital signature based on the discrete logarithm problem on elliptic curve
In recent years it has been trying that with regard to the question of computational complexity of discrete logarithm more strength and less in the elliptic curve than other hard issues, applications such as elliptic curve cryptography, a blind digital signature method, other methods such as encryption replacement DLP. In this paper, a new blind digital signature scheme based on elliptic curve...
متن کاملThe Xedni Calculus and the Elliptic Curve Discrete Logarithm Problem
Let E=F p be an elliptic curve deened over a nite eld, and let S;T 2 E(F p) be two points on E. The Elliptic Curve Discrete Logarithm Problem (ECDLP) asks to nd an integer m so that S = mT in E(F p). In this note we give a new algorithm, dubbed the Xedni Calculus, which might be used to solve the ECDLP. As remarked by Neal Koblitz, the Xedni method is also applicable to the classical discrete l...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Journal of Mathematical Cryptology
سال: 2020
ISSN: 1862-2984,1862-2976
DOI: 10.1515/jmc-2015-0049